The Emergence of Standard Planning and Scheduling System Components Open Planning and Scheduling Architectures

نویسنده

  • Austin Tate
چکیده

As realistic systems are built and commercial toolkits are created for plan ning and scheduling applications it becomes increasingly important that mod ularisation of these standard components is attempted This can lead to re usability embeddability and improved implementation provision One early example of a standardised component is the Truth Criterion condition establishment algorithmwhich is now found at the heart of most activity based planning systems The modularisation of this algorithm has led to an explosion of further development empirical and theoretical study of this component The provision of powerful constraint management languages and tools could lead to a rapid expansion of the bene ts to be gained by identifying more standard components that can be combined and re used in planning and scheduling systems O Plan is a command planning and control architecture which has an open modular structure intended to allow experimentation on or replacement of var ious components This paper describes the modular structure of the system along with the internal and external interface languages and protocols which are being developed on the O Plan project The research is seeking to isolate functionality that may be generally required in a number of applications and across a number of di erent planning scheduling and control systems This paper is intended to further discussions on the identi cation of suitable standard re usable components in planning and scheduling systems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An imperialist competitive algorithm for solving the production scheduling problem in open pit mine

Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...

متن کامل

Flow shop Scheduling Problem with Maintenance Coordination: a New Approach

This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...

متن کامل

A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...

متن کامل

An application of principal component analysis and logistic regression to facilitate production scheduling decision support system: an automotive industry case

Production planning and control (PPC) systems have to deal with rising complexity and dynamics. The complexity of planning tasks is due to some existing multiple variables and dynamic factors derived from uncertainties surrounding the PPC. Although literatures on exact scheduling algorithms, simulation approaches, and heuristic methods are extensive in production planning, they seem to be ineff...

متن کامل

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment

This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993